On mean distance and girth
نویسندگان
چکیده
We bound the mean distance in a connected graph which is not a tree in function of its order n and its girth g. On one hand, we show that mean distance is at most n+1 3 − g(g−4) 12n(n−1) if g is even and at most n+1 3 − g(g−1) 12n(n−1) if g is odd. On the other hand, we prove that mean distance is at least ng 4(n−1) unless G is an odd cycle.
منابع مشابه
On reverse degree distance of unicyclic graphs
The reverse degree distance of a connected graph $G$ is defined in discrete mathematical chemistry as [ r (G)=2(n-1)md-sum_{uin V(G)}d_G(u)D_G(u), ] where $n$, $m$ and $d$ are the number of vertices, the number of edges and the diameter of $G$, respectively, $d_G(u)$ is the degree of vertex $u$, $D_G(u)$ is the sum of distance between vertex $u$ and all other vertices of $G$, and $V(G)$ is the...
متن کاملIndividual distance-independent girth increment model for Douglas-fir in southern Belgium
An individual distance-independent girth increment model for pure stands of Douglas-fir (Pseudotsuga menziesii (MIRB.) FRANCO), comprising two equations, is presented. The data used to fit the model were collected from 1007 trees in 42 plots installed in regularly stocked and even-aged stands located in Wallonia (southern Belgium). Both equations predict girth increment from individual girth, d...
متن کاملExperimental Study of the Residual Stresses in Girth Weld of Natural Gas Transmission Pipeline
In order to achieve integrated condition in the girth welding of high pressure natural gas transmission pipelines, the weld zones and its surrounding area should have good mechanical properties. Residual stresses are an important defect especially in the girth welding of the pipeline. In this study, two API X70 steel pipes (with spiral seam weld) of 56 inches outside diameter and 0.780 inch wal...
متن کاملGirth, minimum degree, independence, and broadcast independence
An independent broadcast on a connected graph $G$is a function $f:V(G)to mathbb{N}_0$such that, for every vertex $x$ of $G$, the value $f(x)$ is at most the eccentricity of $x$ in $G$,and $f(x)>0$ implies that $f(y)=0$ for every vertex $y$ of $G$ within distance at most $f(x)$ from $x$.The broadcast independence number $alpha_b(G)$ of $G$is the largest weight $sumlimits_{xin V(G)}f(x)$of an ind...
متن کاملOn Subgraphs in Distance-Regular Graphs
Terwilliger [15] has given the diameter bound d < (s 1)(k 1) + 1 for distance-regular graphs with girth 2s and valency k. We show that the only distance-regular graphs with even girth which reach this bound are the hypercubes and the doubled Odd graphs. Also we improve this bound for bipartite distance-regular graphs. Weichsel [17] conjectures that the only distance-regular subgraphs of a hyper...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 158 شماره
صفحات -
تاریخ انتشار 2010